Adjusting a conjecture of Erdős
نویسندگان
چکیده
We investigate a conjecture of Paul Erdős, the last unsolved problem among those proposed in his landmark paper [2]. The conjecture states that there exists an absolute constant C > 0 such that, if v1, . . . , vn are unit vectors in a Hilbert space, then at least C 2 n of all ∈ {−1, 1} are such that | Pn i=1 ivi |≤ 1. We disprove the conjecture. For Hilbert spaces of dimension d > 2, the counterexample is quite strong, and implies that a substantial weakening of the conjecture is necessary. However, for d = 2, only a minor modification is necessary, and it seems to us that it remains a hard problem, worthy of Erdős. We prove some weaker related results that shed some light on the hardness of the problem.
منابع مشابه
On the Erdös-Gyárfás conjecture in claw-free graphs
The Erdős-Gyárfás conjecture states that every graph with minimum degree at least three has a cycle whose length is a power of 2. Since this conjecture has proven to be far from reach, Hobbs asked if the Erdős-Gyárfás conjecture holds in claw-free graphs. In this paper, we obtain some results on this question, in particular for cubic claw-free graphs.
متن کاملFractional aspects of the Erdös-Faber-Lovász Conjecture
The Erdős-Faber-Lovász conjecture is the statement that every graph that is the union of n cliques of size n intersecting pairwise in at most one vertex has chromatic number n. Kahn and Seymour proved a fractional version of this conjecture, where the chromatic number is replaced by the fractional chromatic number. In this note we investigate similar fractional relaxations of the Erdős-Faber-Lo...
متن کاملA clone-theoretic formulation of the Erdös-Faber-Lovász conjecture
The Erdős–Faber–Lovász conjecture states that if a graph G is the union of n cliques of size n no two of which share more than one vertex, then χ(G) = n. We provide a formulation of this conjecture in terms of maximal partial clones of partial operations on a set.
متن کامل3 - Paths and Cycles
A forest is an acyclic graph. If F is any forest with k ≥ vertices, then it is fairly straightforward to show ex(n, F ) ≤ (k − 1)n since any n-vertex graph with at least (k− 1)n edges has a subgraph of minimum degree at least k where the forest F can be embedded. The celebrated Erdős-Sós Conjecture [8] states that if T is any tree with k edges, then ex(n, T ) ≤ 12(k − 1)n. This conjecture was r...
متن کاملOn the Erdős-Sós Conjecture and maximum paths
Suppose G is a graph with average degree greater than k − 2. Erdős and Gallai proved that G contains a path on k vertices. In 1962, Erdős and Sós conjectured that G contains every tree on k vertices. Zhou proved the ErdősSós conjecture holds for the case where G has exactly k vertices. Wozniak proved the case where G has order k + 2. This paper’s authors proved the case where G has order k + 3 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Contributions to Discrete Mathematics
دوره 6 شماره
صفحات -
تاریخ انتشار 2011